Central Swaths - A Generalization of the Central Path

نویسنده

  • James Renegar
چکیده

We develop a natural generalization to the notion of the central path – a notion that lies at the heart of interior-point methods for convex optimization. The generalization is accomplished via the “derivative cones” of a “hyperbolicity cone,” the derivatives being direct and mathematicallyappealing relaxations of the underlying (hyperbolic) conic constraint, be it the non-negative orthant, the cone of positive semidefinite matrices, or other. We prove that a dynamics inherent to the derivative cones generates paths always leading to optimality, the central path arising from a special case in which the derivative cones are quadratic. Derivative cones of higher degree better fit the underlying conic constraint, raising the prospect that the paths they generate lead to optimality quicker than the central path.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a generalization of central Armendariz rings

In this paper, some properties of $alpha$-skew Armendariz and central Armendariz rings have been studied by variety of others. We generalize the notions to central $alpha$-skew Armendariz rings and investigate their properties. Also, we show that if $alpha(e)=e$ for each idempotent $e^{2}=e in R$ and $R$ is $alpha$-skew Armendariz, then $R$ is abelian. Moreover, if $R$ is central $alpha$-skew A...

متن کامل

Corrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path

In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...

متن کامل

Design of optimal central guidance of an underwater vehicle in the modeled ship wake

The purpose of this paper is to provide a new algorithm for guidance of an underwater vehicle to reach its target, and demonstrate its effectiveness by simulation with a computer code. The meant of target in here is to chase a ship on the surface of the water. In order to do this, one of the most effective methods is to follow the ship wake which produced behind it. Disadvantages of wake guidan...

متن کامل

A generalization of Bertrand's test

One of the most practical routine tests for convergence of a positive series makes use of the ratio test. If this test fails, we can use Rabbe's test. When Rabbe's test fails the next sharper criteria which may sometimes be used is the Bertrand's test. If this test fails, we can use a generalization of Bertrand's test and such tests can be continued innitely. For simplicity, we call ratio test,...

متن کامل

Generalization of Dynamic Two Stage Models in DEA: An Application in Saderat Bank

Dynamic network data envelopment analysis (DNDEA) has attracted a lot of attention in recent years. On one hand the available models in DNDEA evaluating the performance of a DMU with interrelated processes during specified multiple periods but on the other hand they can only measure the efficiency of dynamic network structure when a supply chain structure present. For example, in the banking in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Foundations of Computational Mathematics

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2013